CONTINUOUS TIME NON-COOPERATIVE $ N $-PERSON MARKOV GAMES
نویسندگان
چکیده
منابع مشابه
A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games
Abstract This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...
متن کاملA TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملMeaningful and meaningless solutions for cooperative n-person games
Game values often represent data that can be measured in more than one acceptable way (e.g., monetary amounts). We point out that in such a case a statement about cooperative n-person game model might be “meaningless” in the sense that its truth or falsity depends on the choice of an acceptable way to measure game values. In particular we analyze statements about solution concepts such as the c...
متن کاملA fuzzy approach to cooperative n-person games
The object of this paper is to provide a systematic treatment of bargaining procedures as a basis for negotiation. An innovative fuzzy logic approach to analyze n-person cooperative games is developed. A couple of indices, the Good Deal Index and the Counterpart Convenience Index are proposed to characterize the heuristic of bargaining and to provide a solution concept. The indices are examined...
متن کاملEfficient Approximation of Optimal Control for Continuous-Time Markov Games
We study the time-bounded reachability problem for continuous-time Markov decision processes (CTMDPs) and games (CTMGs). Existing techniques for this problem use discretisation techniques to break time into discrete intervals of size ε, and optimal control is approximated for each interval separately. Current techniques provide an accuracy of O(ε2) on each interval, which leads to an infeasibly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Mathematical Statistics
سال: 1978
ISSN: 0007-4993
DOI: 10.5109/13126